منابع مشابه
On Nearest-Neighbor Graphs
The “nearest neighbor” relation, or more generally the “k nearest neighbors” relation, defined for a set of points in a metric space, has found many uses in computational geometry and clustering analysis, yet surprisingly little is known about some of its basic properties. In this paper, we consider some natural questions that are motivated by geometric embedding problems. We derive bounds on t...
متن کاملNearest-Neighbor Graphs
Consider a set of points that are independently and uniformly distributed in the -dimensional unit cube. Let ∈ . There exists almost-surely ∈ such that 6= and | − | | − | for all ∈ , 6= , 6= . The point is called the nearest neighbor of and we write ≺ . Note that ≺ does not imply ≺ . Draw an edge connecting and if and only if ≺ ; the resulti...
متن کاملThe Diameter of Nearest Neighbor Graphs
Any connected plane nearest neighbor graph has diameter Ω(n). This bound generalizes to Ω(n) in any dimension d. For any set of n points in the plane, we define the nearest neighbor graph by selecting a unique nearest neighbor for each point, and adding an edge between each point and its neighbor. This is a directed graph with outdegree one; thus it is a pseudo-forest. Each component of the pse...
متن کاملProblem Set 1 K-nearest Neighbor Classification
In this part, you will implement k-Nearest Neighbor (k-NN) algorithm on the 8scenes category dataset of Oliva and Torralba [1]. You are given a total of 800 labeled training images (containing 100 images for each class) and 1888 unlabeled testing images. Figure 1 shows some sample images from the data set. Your task is to analyze the performance of k-NN algorithm in classifying photographs into...
متن کاملNearest-neighbor Queries in Probabilistic Graphs
Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearestneighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the “proximity” or the “distance” between any two nodes in the graph. To that en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2009
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s000186780000313x